What Graphs are 2-Dot Product Graphs?
نویسندگان
چکیده
Let [Formula: see text] be an integer. From a set of text]-dimensional vectors, we obtain text]-dot by letting each vector correspond to vertex and adding edge between two vertices if only their dot product text], for some fixed, positive threshold text]. Dot graphs can used model social networks. Recognizing graph is known NP -hard all fixed To understand the position in landscape classes, consider case investigate how relate number other classes including well-known intersection graphs.
منابع مشابه
What Graphs are 2-Dot Product Graphs?
From a set of d-dimensional vectors for some integer d ≥ 1, we obtain a d-dot product graph by letting each vector au correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product au · av ≥ t, for some fixed, positive threshold t. Dot product graphs can be used to model social networks. To understand the position of d-dot product graphs in the land...
متن کاملDirected Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to clustering, the small world property, and degree distribution. These models are motivated by the random dot product graphs developed by Kraetzl, Nickel and Scheinerman. We extend their results to fully parameterize the condi...
متن کاملDot Product Representations of Graphs
We introduce the concept of dot product representations of graphs, giving some motivations as well as surveying the previously known results. We extend these representations to more general fields, looking at the complex numbers, rational numbers, and finite fields. Finally, we study the behavior of dot product representations in field extensions.
متن کاملDot Product Representations of Planar Graphs
A graph G is a k-dot product graph if there exists a vector labelling u : V (G)→ Rk such that u(i)Tu(j) ≥ 1 if and only if ij ∈ E(G). Fiduccia, Scheinerman, Trenk and Zito [4] asked whether every planar graph is a 3-dot product graph. We show that the answer is “no”. On the other hand, every planar graph is a 4-dot product graph. We also answer the corresponding questions for planar graphs of p...
متن کاملScalar Product Graphs of Modules
Let R be a commutative ring with identity and M an R-module. The Scalar-Product Graph of M is defined as the graph GR(M) with the vertex set M and two distinct vertices x and y are adjacent if and only if there exist r or s belong to R such that x = ry or y = sx. In this paper , we discuss connectivity and planarity of these graphs and computing diameter and girth of GR(M). Also we show some of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry and Applications
سال: 2021
ISSN: ['0218-1959', '1793-6357']
DOI: https://doi.org/10.1142/s0218195921500011